On index policies for stochastic minsum scheduling
نویسندگان
چکیده
منابع مشابه
Optimality of Index Policies for Stochastic Scheduling with Switching Penalties
We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that deenes an...
متن کاملImproved Scheduling Algorithms for Minsum Criteria
including environments with parallelizable jobs, jobs contending for shared resources, tree precedence-constrained jobs, as well as shop scheduling models. In several of these cases, we give the first constant performance guarantee achieved on-line. Finally, one of the consequences of our work is the surprising structural property that there are schedules that simultaneously approximate the opt...
متن کاملLinear preselective policies for stochastic project scheduling
We introduce a new class of policies for stochastic project scheduling with resource constraints, the linear preselective policies. They combine the benefits of two known classes of scheduling policies for stochastic and deterministic scheduling, viz. priority policies and preselective policies. Priority policies solve resource conflicts by means of a priority list (list scheduling). They have ...
متن کاملOptimality of Index Policies for Stochastic Scheduling with Switching Penalties Author(s):
We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines a...
متن کاملThe Price of Anarchy for Minsum Related Machine Scheduling
We address the classical uniformly related machine scheduling problem with minsum objective. The problem is solvable in polynomial time by the algorithm of Horowitz and Sahni. In that solution, each machine sequences its jobs shortest first. However when jobs may choose the machine on which they are processed, while keeping the same sequencing rule per machine, the resulting Nash equilibria are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2019
ISSN: 0167-6377
DOI: 10.1016/j.orl.2019.03.007